Machine-learning-based, adaptive updating of quantitative data in database system

ABSTRACT

Machine-learning-based, adaptive updating of quantitative data in a database system is provided, which includes training one or more machine learning models to facilitate adaptively updating quantitative data in the database system, and ascertaining an update urgency index for updating the quantitative data for one or more data structures of the database system. The update urgency index is representative of an urgency for updating the quantitative data for the data structure(s) and is based, at least in part, on real-time query metrics. The machine learning model(s) is used to adaptively update the quantitative data, where the adaptively updating is based, at least in part, on the ascertained update urgency index. Processing of a database query is optimized in the database system using the adaptively updated quantitative data.

BACKGROUND

One or more aspects relate, in general, to facilitating processingwithin a computing environment, and in particular, to improving suchprocessing.

Database management systems, such as relational database managementsystems, use an optimizer component that transforms structured querylanguage (SQL) queries or statements into executable code. In one ormore embodiments, the optimizer is configured to, for instance, estimatethe number of rows that qualify for each prediction, and to select analgorithm which most efficiently accesses the required data. In oneembodiment, the query optimizer generates one or more query plans foreach query, each of which may be a mechanism used to run the query. Thequery optimizer generates the query plan(s) using applicablequantitative data for the data structures of the database system.

SUMMARY

Certain shortcomings of the prior art are overcome and additionaladvantages are provided through the provision, in one or more aspects,of a computer program product for facilitating processing within acomputing environment. The computer program product includes one or morecomputer-readable storage media having program instructions embodiedtherewith. The program instructions are readable by a processing circuitto cause the processing circuit to perform a method which includestraining one or more machine learning models to facilitate adaptivelyupdating quantitative data in a database system, and ascertaining anupdate urgency index for updating quantitative data for one or more datastructures of the database system. The update urgency index isrepresentative of an urgency for updating the quantitative data for thedata structure(s) and is based, at least in part, on real-time querymetrics. The method further includes adaptively updating, using themachine learning model(s), the quantitative data. The adaptivelyupdating is based, at least in part, on the ascertained update urgencyindex. Further, the method includes optimizing processing of a databasequery in the database system using the adaptively updated quantitativedata.

Computer systems and computer-implemented methods relating to one ormore aspects are also described and claimed herein. Further, servicesrelating to one or more aspects are also described and may be claimedherein.

Additional features and advantages are realized through the techniquesdescribed herein. Other embodiments and aspects of the invention aredescribed in detail herein and are considered a part of the claimedaspects.

BRIEF DESCRIPTION OF THE DRAWINGS

One or more aspects of the present invention are particularly pointedout and distinctly claimed as examples in the claims at the conclusionof the specification. The foregoing and other objects, features, andadvantages of the invention are apparent from the following detaileddescription taken in conjunction with the accompanying drawings inwhich:

FIG. 1A depicts one example of a computing environment to incorporateand use one or more aspects of the present invention;

FIG. 1B depicts further details of a processor of FIG. 1A, in accordancewith one or more aspects of the present invention;

FIG. 1C depicts further details of a database system of FIG. 1A, inaccordance with one or more aspects of the present invention;

FIG. 2 illustrates another example of a computing environment toincorporate and user one or more aspects of the present invention;

FIG. 3 depicts one embodiment of a workflow illustrating certain aspectsof one or more embodiments of the present invention;

FIG. 4 depicts one example of a data structure useful in ascertaining adifference between estimated query execution and actual query executionas an indicator of whether quantitative data is outdated, in accordancewith one or more aspects of the present invention;

FIG. 5 depicts one embodiment of a workflow for determining a real-timequery metric based on a difference between predicted and actualexecution time of one or more queries to a data structure, in accordancewith one or more aspects of the present invention;

FIGS. 6A & 6B illustrate linear fitting and Fourier fitting,respectively, of query execution time data for facilitating predictingoutdated quantitative data, in accordance with one or more aspects ofthe present invention;

FIG. 7A depicts an example table obtained (in one embodiment) byaveraging execution time for query executions within an executionsequence for use in identifying a data structure with query executionperformance that is trending poor, in accordance with one or moreaspects of the present invention;

FIG. 7B depicts one embodiment of a workflow illustrating periodicitydetection using autocorrelation coefficients analysis to facilitateidentifying a linear fitting or Fourier fitting case for use inpredicting a query execution time to facilitate predictively identifyinga data structure with query execution performance that is trending poor,in accordance with one or more aspects of the present invention;

FIG. 8 depicts one embodiment of an exemplary decision tree for amachine learning model, for use in ascertaining, based at least in parton an update urgency index, whether quantitative data is to be currentlyupdated, in accordance with one or more aspects of the presentinvention;

FIG. 9A depicts yet another example of a computing environment toincorporate and use one or more aspects of the present invention;

FIG. 9B depicts further details of the memory of FIG. 9A, in accordancewith one or more aspects of the present invention;

FIG. 10 depicts one embodiment of a cloud computing environment, inaccordance with one or more aspects of the present invention; and

FIG. 11 depicts one example of abstraction model layers, in accordancewith one or more aspects of the present invention.

DETAILED DESCRIPTION

The accompanying figures, in which like reference numerals refer toidentical or functionally similar elements throughout the separateviews, and which are incorporated in and form a part of thisspecification, further illustrate the present invention and, togetherwith the detailed description of the invention, serve to explain aspectsof the present invention. Note in this regard that descriptions ofwell-known systems, devices, database systems, processing techniques,etc., are omitted so as to not unnecessarily obscure the invention indetail. It should be understood, however, that the detailed descriptionand this specific example(s), while indicating aspects of the invention,are given by way of illustration only, and not limitation. Varioussubstitutions, modifications, additions, and/or other arrangements,within the spirit or scope of the underlying inventive concepts will beapparent to those skilled in the art from this disclosure. Note further,that numerous inventive aspects and features are disclosed herein, andunless inconsistent, each disclosed aspect or feature is combinable withany other disclosed aspect or feature as desired for a particularapplication of the concepts disclosed herein.

Note also that illustrative embodiments are described below usingspecific code, designs, architectures, database systems, protocols,layouts, schematics or tools, only as examples, and not by way oflimitation. Further, the illustrative embodiments are described incertain instances using particular hardware, software, tools, or dataprocessing environments only as example for clarity of description. Theillustrative embodiments can be used in conjunction with othercomparable or similarly purposed structures, systems, applications, orarchitectures. One or more aspects of an illustrative embodiment can beimplemented in hardware, software, or a combination thereof.

As understood by one skilled in the art, program code, as referred to inthis application, can include both hardware and software. For example,program code in certain embodiments of the present invention can includefixed function hardware, but other embodiments can utilize asoftware-based implementation of the functionality described. Certainembodiments combine both types of program code. One example of programcode, also referred to as one or more programs or program instructions,is depicted in FIG. 1A as one or more of application program(s) 116,computer-readable program instruction(s) 120, and/or database system122, stored in memory 106 of computer system 102, as well as programs136 and computer-readable program instruction(s) 138, stored in a datastorage device 134 accessed by computer system 102.

One embodiment of a computing environment to incorporate and use one ormore aspects of the present invention is described with reference toFIG. 1A. As an example, the computing environment is based on the IBM®z/Architecture® instruction set architecture, offered by InternationalBusiness Machines Corporation, Armonk, New York. One embodiment of thez/Architecture instruction set architecture is described in apublication entitled, “z/Architecture Principles of Operation”, IBMPublication No. SA22-7832-12, Thirteenth Edition, September 2019, whichis hereby incorporated herein by reference in its entirety. Thez/Architecture instruction set architecture, however, is only oneexample architecture; other architectures and/or other types ofcomputing environments of International Business Machines Corporationand/or of other entities may include and/or use one or more aspects ofthe present invention. z/Architecture and IBM are trademarks orregistered trademarks of International Business Machines Corporation inat least one jurisdiction.

Referring to FIG. 1A, a computing environment 100 includes, forinstance, a computer system 102 shown, e.g., in the form of ageneral-purpose computing device. Computer system 102 can include, butis not limited to, one or more general-purpose processors or processingunits 104 (e.g., central processing units (CPUs)), a memory 106 (a.k.a.,system memory, main memory, main storage, central storage or storage, asexamples), and one or more input/output (I/O) interfaces 108, coupled toone another via one or more buses and/or other connections. Forinstance, processors 104, and memory 106 are coupled to I/O interfaces108 via one or more buses 110, and processors 104, are coupled to oneanother and memory 106 via one or more buses 111.

Bus 111 is, for instance, a memory or cache coherence bus, and bus 110represents, e.g., one or more of any of several types of bus structures,including a memory bus or memory controller, a peripheral bus, anaccelerated graphics port, and a processor or local bus using any of avariety of bus architectures. By way of example, and not limitation,such architectures include the Industry Standard Architecture (ISA), theMicro Channel Architecture (MCA), the Enhanced ISA (EISA), the VideoElectronics Standards Association (VESA) local bus, and the PeripheralComponent Interconnect (PCI).

Note that one or more special-purpose processors (e.g., AI acceleratorsor neural network accelerators) (not shown) can be separate from butcoupled to the one or more general-purpose processors 104 and/or can beembedded within one or more general-purpose processors 104. Manyvariations are possible.

Memory 106 can include, for instance, a cache 112, such as a sharedcache, which may be coupled to local caches 114 of processors 104 via,e.g., one or more buses 111. Further, memory 106 can include one or moreprograms or applications 116 and at least one operating system 118. Anexample operating system includes an IBM® z/OS® operating system,offered by International Business Machines Corporation, Armonk, NewYork. z/OS is a trademark or registered trademark of InternationalBusiness Machines Corporation in at least one jurisdiction. Otheroperating systems offered by International Business Machines Corporationand/or other entities may also be used. Memory 106 can also include oneor more computer readable program instructions 120, which can beconfigured to carry out functions of embodiments of aspects of theinvention.

Moreover, in one or more embodiments, memory 106 includes a databasesystem 122, and processor firmware (now shown). Processor firmwareincludes, e.g., the microcode or millicode of a processor. It includes,for instance, the hardware-level instructions and/or data structuresused in implementation of higher level machine code. In one embodiment,it includes, for instance, proprietary code that is typically deliveredas microcode or millicode that includes trusted software, microcode ormillicode specific to the underlying hardware and controls operatingsystem access to the system hardware.

Computer system 102 can communicate via, e.g., I/O interfaces 108 withone or more external devices 130, such as a user terminal, a tape drive,a pointing device, a display, and one or more data storage devices 134,etc. A data storage device 134 can store one or more programs 136, oneor more computer readable program instructions 138, and/or data, etc.The computer readable program instructions can be configured to carryout functions of embodiments of aspects of the invention.

Computer system 102 can also communicate via, e.g., I/O interfaces 108with network interface 132, which enables computer system 102 tocommunicate with one or more networks, such as a local area network(LAN), a general wide area network (WAN), and/or a public network (e.g.,the Internet), providing communication with other computing devices orsystems.

Computer system 102 can include and/or be coupled toremovable/non-removable, volatile/non-volatile computer system storagemedia. For example, it can include and/or be coupled to a non-removable,non-volatile magnetic media (typically called a “hard drive”), amagnetic disk drive for reading from and writing to a removable,non-volatile magnetic disk (e.g., a “floppy disk”), and/or an opticaldisk drive for reading from or writing to a removable, non-volatileoptical disk, such as a CD-ROM, DVD-ROM or other optical media. Itshould be understood that other hardware and/or software componentscould be used in conjunction with computer system 102. Examples,include, but are not limited to: microcode or millicode, device drivers,redundant processing units, external disk drive arrays, RAID systems,tape drives, and data archival storage systems, etc.

Computer system 102 can be operational with numerous othergeneral-purpose or special-purpose computing system environments orconfigurations. Examples of well-known computing systems, environments,and/or configurations that are suitable for use with computer system 102include, but are not limited to, personal computer (PC) systems, servercomputer systems, thin clients, thick clients, handheld or laptopdevices, multiprocessor systems, microprocessor-based systems, networkPCs, minicomputer systems, mainframe computer systems, and distributedcloud computing environments that include any of the above systems ordevices, and the like.

In one example, a processor (e.g., processor 104) includes a pluralityof functional components (or a subset thereof) used to executeinstructions and/or operations. As depicted in FIG. 1B, these functionalcomponents include, for instance, an instruction fetch component 150 tofetch instructions to be executed; an instruction decode unit 152 todecode the fetched instructions and to obtain operands of the decodedinstructions; one or more instruction execute components 154 to executethe decoded instructions; a memory access component 156 to access memoryfor instruction execution, if necessary; and a write back component 158to provide the results of the executed instructions. One or more of thecomponents can access and/or use one or more registers 160 ininstruction processing.

In one or more implementations, a database system (e.g., database system122 of FIG. 1A) includes a database management system 170 and one ormore databases 180, such as depicted in FIG. 1C. In one embodiment,database management system 170 includes an optimization component 172(or optimizer) for optimizing database query processing to reducedatabase system response time, and an adaptive updating of quantitativedata facility 174 implementing, for instance, one or more aspectsdisclosed herein, and including one or more machine learning models 176.At a high level, database performance refers to the rate at whichdatabase management system 170 supplies information from one or moredata structures 182 of database(s) 180 based on queries. The queryoptimizer component analyzes, in one embodiment, structured querylanguage (SQL) queries, and determines the efficient executionmechanisms within the database(s) 180. Optimization component 172, orquery optimizer, generates one or more query plans for each query, eachof which can be a mechanism used to run a query within the databasesystem.

There are a variety of database systems and database management systemsavailable. In one or more database embodiments, a data structure 182, ortable, is a logical structure made up of rows and columns. Rows have nofixed order, and so when data is retrieved, it might need to be sorted.The order of the columns is the ordered specified when the datastructure is created. At the intersection of every column and row is aspecific data term called a value, or an atomic value, accessed by astructured query language (SQL) query.

Quantitative data provides the optimizer component with accurateinformation for selecting an optimal query access plan for the database.Accurate quantitative data is needed for optimal database queryprocessing in a database system. The database system typically providesa user with a utility to collect quantitative data or information foruse by the optimizer component. For instance, a Db2® database is afamily of data management products, including database servers,developed by International Business Machines Corporation. (Db2 is aregistered trademark of IBM in at least one jurisdiction.) A Db2database is a relational database that delivers data management andanalytics capabilities for transactional workloads. In the Db2environment, RUNSTATS is a Db2 utility that scans, for instance, a tablespace or indexes to gather quantitative data or information about spaceutilization and index efficiency. The information gather is stored inthe Db2 system tables and used by the SQL optimizer as quantitative datato select a best-access path during a query bind process.

In one or more implementations, the quantitative data utility in thedatabase system can have the ability to update informationautomatically. Automatic quantitative data collection typically occursin one of two ways, either as real-time quantitative data collection(such as at statement compile time, or information can be fabricated byusing certain metadata), or as background quantitative data collection(for instance, at fixed intervals).

Existing automatic quantitative data collection solutions can degradedatabase system performance, and are often not used in practice. Forinstance, when based on a data change ratio, the automatic collection ofinformation does not take into account real-time workloadconsiderations, and can result in unnecessary quantitative datacollection, which wastes system resources. An approach which ispredefined and fixed in time proceeds without considering real-timedatabase system states, and can cause resource contention betweenquantitative data collection and normal database system workload.Another approach is to collect quantitative data at regular intervals,which can at times delay the database system from gaining betterperformance by not having available timely updated statistics.

Disclosed herein are computer program products, computer systems, andcomputer-implemented methods which facilitate processing within acomputing environment by adaptively updating quantitative data in thedatabase system. In one or more implementations, to evaluate aquantitative data collection requirement, the update facility not onlytakes data changes into account, but also considers real-time querymetrics, such as real-time data accesses or selections, and query and/orsystem performance data. In this manner, quantitative data is collectedfor one or more data structures (or tables) that have significant datachanges, or where query performance is poor, or predicted to be poorsoon. The predicted performance can be ascertained via one or moremachine learning models trained to predict when performance is degradingdue to outdated quantitative data. In one or more embodiments, theprediction can be based on different regression algorithms and a resultof periodicity detection, considering history and dynamic performancemetrics of real workloads in the database system. Using a machinelearning model, such as a decision tree model, the adaptive updatefacility determines whether to currently collect quantitative data forone or more data structures, and ensures, in one embodiment, that neededquantitative data updates are executed soon, while non-urgentquantitative data updates are handled, for instance, during an idle timeframe in the database system, or a less busy timeframe in the databasesystem. In this manner, updating of quantitative data adaptively occurswhen necessary, such as above an urgency threshold, due to thequantitative data or statistics requirement being evaluated accurately,with an automatic optimization ability being applied. The updating ofthe quantitative data is also run at the correct time, such as whenquery performance is poor, or where query performance is predicted to bepoor in the near future, or at a time when executing the update willhave little influence on one or more executing database systemapplications.

In one or more embodiments, computer program products, computer systems,and computer-implemented methods are provided for facilitatingprocessing within a computing environment, and in particular, within acomputing environment including a database system. In one or moreembodiments, the method includes training one or more machine learningmodels to facilitate adaptively updating quantitative data in thedatabase system, and ascertaining an update urgency index for updatingquantitative data for one or more data structures of the databasesystem. The update urgency index is representative of a current urgencyfor updating the quantitative data for the data structure(s) and isbased, at least in part, on real-time query metrics. The method includesadaptively updating, using the machine learning model(s) thequantitative data, where the adaptively updating is based, at least inpart, on the ascertained update urgency index. Further, the methodincludes optimizing processing of a database query in the databasesystem using the adaptively updated quantitative data.

In one embodiment, the real-time query metrics include a volume andfrequency of database queries to the data structure(s) in the databasesystem.

In one or more implementations, the real-time query metrics are based,at least in part, on collecting M top-most database queries to the datastructure(s) in order of processor usage for a time interval, andestimating therefor a deviation in usage from an estimated processorusage for the M top-most database queries, the estimated deviation beingrepresentative of a performance deviation of the M top-most databasequeries, where M≥1.

In one or more implementations, the method further includes predicting,via the machine-learning model(s), an execution time of one or moredatabase queries to the data structure(s), where the real-time querymetrics are based on a difference between the predicted execution timeof the one or more database queries to the data structure(s) incomparison to an actual execution time of the one or more databasequeries to the data structure(s). In one embodiment, the differencebetween the predicted execution time of the one or more database queriesto the data structure(s) and the actual execution time of the one ormore database queries to the data structure(s) exceeding a thresholdpredicts poor query performance, and increases the update urgency indexto indicate and urgency for updating the quantitative data of the datastructure(s) in the database system. In one embodiment, the predicting,by the machine learning model(s) the execution time for the one or moredatabase queries uses regression analysis based on time-series data.

In one or more embodiments, the adaptively updating includes adaptivelyupdating the quantitative data based on a relative urgency of theascertained update urgency index, where the adaptively updating includescurrently proceeding with updating of the quantitative data when theascertained update urgency index indicates updating of the quantitativedata is urgent, and delaying proceeding with updating of thequantitative data where the ascertained update urgency index indicatesthat the updating is not urgent, or less urgent.

In one or more embodiments, the method further includes identifying alist of data structures for which the update urgency index is to beascertained, where the one or more data structures is in the list ofdata structures, and the list of data structures includes any datastructure with major data changes since the last updating of thequantitative data, any data structure with no quantitative data, and anydata structure with stale quantitative data. In one or more embodiments,the method further includes predictively identifying, by the machinelearning model(s), a data structure in the database system withdegrading query execution performance, wherein the list of datastructure(s) further includes the predictively identified data structurewith degrading query execution performance.

FIG. 2 depicts a further embodiment of a computing environment or system200, incorporating, or implementing, certain aspects of an embodiment ofthe present invention. In one or more implementations, system 200 can bepart of a computing environment, such as computing environment 100described above in connection with FIG. 1 . System 200 includes one ormore computing resources 210 that execute program code 212 thatimplements, for instance, an adaptive updating of quantitative datafacility, and includes a cognitive engine 214, which has one or moremachine-learning agents 216, and one or more machine-learning models218. Data 220, such as the data metrics discussed herein, is used bycognitive engine 214, to train model(s) 218, to (for instance) predictquery performance degradation in the database system, and to generateone or more update actions 230, etc., based on the particularapplication of the machine-learning model. In implementation, system 200can include, or utilize, one or more networks for interfacing variousaspects of computing resource(s) 210, as well as one or more datasources providing data 220, and one or more systems receiving thedecision to adaptively update the quantitative data for one or more datastructures in the database (based, e.g., on a predicted queryperformance degradation) and/or other output update action, etc., 230 ofmachine-learning model(s) 218. By way of example, the network can be,for instance, a telecommunications network, a local-area network (LAN),a wide-area network (WAN), such as the Internet, or a combinationthereof, and can include wired, wireless, fiber-optic connections, etc.The network(s) can include one or more wired and/or wireless networksthat are capable of receiving and transmitting data, including trainingdata for the machine-learning model, predicted traffic event and anoutput solution, recommendation, action, of the machine-learning model,such as discussed herein.

In one or more implementations, computing resource(s) 210 houses and/orexecutes program code 212 configured to perform methods in accordancewith one or more aspects of the present invention. By way of example,computing resource(s) 210 can be a computing-system-implementedresource(s). Further, for illustrative purposes only, computingresource(s) 210 in FIG. 2 is depicted as being a single computingresource. This is a non-limiting example of an implementation. In one ormore other implementations, computing resource(s) 210, by which one ormore aspects of machine-learning processing such as discussed herein areimplemented, could, at least in part, be implemented in multipleseparate computing resources or systems, such as one or more computingresources of a cloud-hosting environment, by way of example.

Briefly described, in one embodiment, computing resource(s) 210 caninclude one or more processors, for instance, central processing units(CPUs). Also, the processor(s) can include functional components used inthe integration of program code, such as functional components to fetchprogram code from locations in such as cache or main memory, decodeprogram code, and execute program code, access memory for instructionexecution, and write results of the executed instructions or code. Theprocessor(s) can also include a register(s) to be used by one or more ofthe functional components. In one or more embodiments, the computingresource(s) can include memory, input/output, a network interface, andstorage, which can include and/or access, one or more other computingresources and/or databases, as required to implement themachine-learning processing described herein. The components of therespective computing resource(s) can be coupled to each other via one ormore buses and/or other connections. Bus connections can be one or moreof any of several types of bus structures, including a memory bus or amemory controller, a peripheral bus, an accelerated graphics port, and aprocessor or local bus, using any of a variety of architectures. By wayof example, but not limitation, such architectures can include theIndustry Standard Architecture (ISA), the micro-channel architecture(MCA), the enhanced ISA (EISA), the Video Electronic StandardAssociation (VESA), local bus, and peripheral component interconnect(PCI). As noted, examples of a computing resource(s) or a computersystem(s) which can implement one or more aspects disclosed herein aredescribed further herein with reference to FIG. 1 , as well as withreference to FIGS. 9A-11 .

As noted, program code 212 executes, in one implementation, a cognitiveengine 214 which includes one or more machine-learning agents 216 thatfacilitate training one or more machine-learning models 218. Themachine-learning models are trained using training data that can includea variety of types of data, depending on the model and the data sources.In one or more embodiments, program code 212 executing on one or morecomputing resources 210 applies machine-learning algorithms ofmachine-learning agent 216 to generate and train the model(s), which theprogram code then utilizes to predict, for instance, a query performancedegradation in a database, and depending on the application, to performan action (e.g., provide a solution, make a recommendation, perform atask, etc.). In an initialization or learning stage, program code 212trains one or more machine-learning models 218 using obtained trainingdata that can include, in one or more embodiments, real-time querymetrics, such as described herein.

Training data used to train the model (in embodiments of the presentinvention) can include a variety of types of data, such as datagenerated by one or more database management system components orutilities, in communication with the computing resource(s). Programcode, in embodiments of the present invention, can performmachine-learning analysis to generate data structures, includingalgorithms utilized by the program code to predict and/or perform amachine-learning action. As known, machine-learning (ML) solves problemsthat cannot be solved by numerical means alone. In this ML-basedexample, program code extract features/attributes from training data,which can be stored in memory or one or more databases. The extractedfeatures are utilized to develop a predictor function, h(x), alsoreferred to as a hypothesis, which the program code utilizes as amachine-learning model. In identifying machine-learning model 218,various techniques can be used to select features (elements, patterns,attributes, etc.), including but not limited to, diffusion mapping,principal component analysis, recursive feature elimination (a bruteforce approach to selecting features), and/or a random forest, to selectthe attributes related to the particular model. Program code can utilizea machine-learning algorithm to train machine-learning model (e.g., thealgorithms utilized by program code), including providing weights forconclusions, so that the program code can train any predictor orperformance functions included in the machine-learning model. Theconclusions can be evaluated by a quality metric. By selecting a diverseset of training data, the program code trains the machine-learning modelto identify and weight various attributes (e.g., features, patterns)that correlate to enhanced performance of the machine-learned model.

Some embodiments of the present invention can utilize IBM Watson® aslearning agent. IBM Watson® is a registered trademark of InternationalBusiness Machines Corporation, Armonk, New York, USA in one or morejurisdictions. In embodiments of the present invention, the respectiveprogram code can interface with IBM Watson® application programinterfaces (APIs) to perform machine-learning analysis of obtained data.In some embodiments of the present invention, the respective programcode can interface with the application programming interfaces (APIs)that are part of a known machine-learning agent, such as the IBM Watson®application programming interface (API), a product of InternationalBusiness Machines Corporation, to determine impacts of data on themachine-learning model, and to update the model, accordingly. In one ormore embodiments, program code of the present invention can utilizeand/or tie together multiple existing artificial intelligence (AI)applications.

In one or more embodiments of the present invention, the program codecan utilize a decision tree approach such as described herein, and/or aneural network to analyze training data and/or collected data togenerate an operational machine-learning model.

Neural networks are a programming paradigm which enable a computer tolearn from observational data. This learning is referred to as deeplearning, which is a set of techniques for learning in neural networks.Neural networks, including modular neural networks, are capable ofpattern (e.g., state) recognition with speed, accuracy, and efficiency,in situations where datasets are mutual and expansive, including acrossa distributed network, including but not limited to, cloud computingsystems. Modern neural networks are non-linear statistical data modelingtools. They are usually used to model complex relationships betweeninputs and outputs, or to identify patterns (e.g., states) in data(i.e., neural networks are non-linear statistical data modeling ordecision-making tools). In general, program code utilizing neuralnetworks can model complex relationships between inputs and outputs andidentified patterns in data. Because of the speed and efficiency ofneural networks, especially when parsing multiple complex datasets,neural networks and deep learning provide solutions to many problems inmulti-source processing, which program code, in embodiments of thepresent invention, can utilize in implementing a machine-learning model,such as described herein.

By way of further explanation, FIG. 3 depicts one embodiment of aworkflow illustrating certain aspects of one or more embodiments of thepresent invention. In one or more implementations, the illustratedworkflow is implemented by an adaptive updating of quantitative datafacility, such as described herein.

As discussed, disclosed herein is an adaptive facility for updatingquantitative data, or statistics, for particular data structures in adatabase system, when needed in real-time. For instance, in one or moreembodiments, quantitative data updating is triggered when queryperformance to a particular data structure is poor, or is predicted bythe system to be degrading towards poor performance. Further, in one ormore implementations, quantitative data updating can be selectivelydelayed when less urgent to be executed when it will not effectperformance of one or more database system applications. As describedherein, quantitative data is updated adaptively in a database based onreal-time query performance, and in a manner such that the quantitativedata is updated automatically at the correct time for performance of thedatabase system. For instance, quantitative data can be identified forupdating where query performance is poor for one or more datastructures, and actually updated at a time when the updating will havelittle influence on one or more other executing database applications.

In the workflow example of FIG. 3 , adaptive updating starts 300, usinga performance metrics collector 301, with collection of one or morelists of data structures, referred to as TableLists. In FIG. 3 , thisincludes collecting a TableList1 302 with data structures having majordata changes since the associated quantitative data was last updated,and collecting another TableList2 303 with empty associated quantitativedata, or stale associated quantitative data. The union of TableList1 andTableList2 provides a TableList 310 of data structures for which anupdate urgency index is to be ascertained, in accordance with one ormore aspects disclosed herein.

As a specific example, collecting TableList1 302 and TableList2 303 toform TableList 310 can include:

-   -   Collect TableList with Major Data Change 301        -   Define Configurable Parameter:            -   X=Data Change Ratio Threshold        -   Steps:            -   1. Collect insert/update/delete (IUD) Ratio for all data                structures or tables (T):

${{IUD\_ Ratio}({Ti})} = \frac{{IUD\_ Counter}({Ti})}{{Number\_ of}{\_ Rows}\left( {Ti} \right)}$

-   -   -   -   2. Collect all tables (T) having IUD_Ratio>=X %:                TableList1={T1′,T2′, . . . Ta′}

    -   Collect Table List with Empty or Stale Quantitative Data 302        -   Define Configurable Parameter Y:            -   Y=Quantitative data collected Y days before is Stale                (e.g., 10 days)        -   Steps:            -   1. Collect all tables (T) with last update date that is                NULL, or where last update date—current data>=Y days                TableList2={T1″,T2″, . . . Tb″}            -   Form the TableList 310 Union as:                TableList=TableList1∪TableList2={T1,T2, . . . Tn}

With TableList 310, an update urgency index (UUI) is obtained forupdating quantitative data for each data structure in the TableList,using one or more query metrics. As illustrated, the query metrics caninclude metrics based on data change 311, metrics based on real-timevolume and frequency of data reads or accesses 312, metrics on estimatedreal-time deviation of top (CPU time) SQL queries from anticipatedexecution time 313, and real-time predicted poor performance of SQLqueries for one or more data structures in the TableList 314. In one ormore specific embodiments, determining the update urgency indexconsiders all four metrics, and is based on a determined IUD ratio, asfollows:

-   -   Calculate Quantitative Data Update Urgency Index (UUI) based on        IUD Ratio        -   Define Configurable Parameter CP1:            -   CP1=Credit Points for Data Change        -   Steps:            -   1. For each table Ti in TableList {T1, T2, . . . Tn},                collect IUD Ratio:

${{IUD\_ Ratio}({Ti})} = \frac{{IUD\_ Counter}({Ti})}{{Number\_ of}{\_ Rows}\left( {Ti} \right)}$If IUD_Ratio(Ti)<X %: IUD_Ratio(Ti)=0

-   -   -   -   2. Sum of IUD ratios for TableList:

${SUM\_ IUDRatio} = {\sum_{i = 1}^{n}\left( {{IUD\_ Ratio}({Ti})} \right)}$

-   -   -   -   3. For each table Ti in TableList {T1, T2, . . . Tn},                determine UUI—Update Urgency Index

${{UUI}({Ti})} = {\frac{CP1}{{SUM\_ ID}{\_ Ratio}}*{IUD\_ Ratio}({Ti})}$

-   -   -   -   4. Get candidate list 315 of data structure(s) with                associated UUIs:                CanditateList={(T1,UUI(T1)),(T2,UUI(T2)), . . .                (Tn,UUI(Tn))}

In addition, determining the quantitative data update urgency indexincludes, in one embodiment, redetermining the update urgency index forthe data structure(s) based on volume and frequency of data reads oraccesses 312. By way of example, one embodiment of this includes:

-   -   Recalculate Update Urgency Index—based on volume and frequency        of data reads 312        -   Define Configurable Parameter CP2:            -   CP2—Credit Points for Data Reads        -   Steps:            -   1. For each table Ti in CandidateList 315, collect:                -   TotalPages(Ti)=Total number of pages of Ti                -   PageReads(Ti)=Number of page reads of Ti

${{PageReadsRatio}({Ti})} = \frac{{Page}Read{s\left( {Ti} \right)}}{{TotalPages}\left( {Ti} \right)}$

-   -   -   -   -   NumberAccess(Ti)=Number of times table Ti was                    accessed

            -   2.

${TotalPageReadsRatio} = {\sum_{i = 1}^{n}\left( {{PageReadsRatio}({Ti})} \right)}$

-   -   -   -   3.

${TotalAccesses} = {\sum_{i = 1}^{n}\left( {{numberAccess}({Ti})} \right)}$

-   -   -   -   4. Recalculate Update Urgency Index (UUI) for table Ti:

${{UUI}\left( {Ti}\text{)+} \right.} = {{\frac{CP2*{0.5}}{TotalPageReadsRatio}*{{PageReadsRatio}({Ti})}} + {\frac{CP2*{0.5}}{TotalAccesses}*{{numberAccess}({Ti})}}}$

-   -   -   -   5. Get updated CandidateList:                CandidateList={(T1,UUI(T1),(T2,UUI(T2)), . . .                (Tn,UUI(Tn))}

In the embodiment of FIG. 3 , the update urgency index (UUI) can befurther qualified by redetermining the index based on, for instance, anestimated performance deviation of the top M SQL queries to the datastructures in the TableList. In one embodiment, this can include:

-   -   Define Configurable Parameters:        -   M=Top M SQLs by CPU usage (where M≥1)        -   CP3=Credit Points for Top SQLs    -   Steps:        -   1. Collect Top M SQLs order by CPU usage:            CurTopSQLList={SQL1,SQL2, . . . SQLy}        -   2. As illustrated in FIG. 4 , and as discussed below,            collect R1, R2, R3, C1, C2, C3 for each SQLi in            CurTopSQLList:            -   SQLi(R1, R2, R3, C1, C2, C3)        -   3. Calculate Estimated Deviation for SQLi

${{EstDeviation}({SQLi})} = \frac{\left( {\frac{SQL{i\left( {R2} \right)}}{SQL{i\left( {R1} \right)}} - \frac{SQL{i\left( {R3} \right)}}{SQL{i\left( {R1} \right)}}} \right)^{2} + \left( {\frac{SQL{i\left( {C2} \right)}}{SQL{i\left( {C1} \right)}} - \frac{SQL{i\left( {C3} \right)}}{SQL{i\left( {C1} \right)}}} \right)^{2}}{4}$

-   -   -   4. For each table Tj in TableList, determine its            Accumulative Estimated Deviation:            If Ti is referenced in SQLi:            AccumEstDeviation(Tj)+=EstDeviation(SQLi)        -   5. For each data structure Tk in TableList, recalculate its            Update Urgency Index

${{UUI}\left( {Tk}\text{)+} \right.} = {\frac{CP3}{\sum_{h = 1}^{n}\left( {AccumEstDeviatio{n\left( {Th} \right)}} \right)}*AccumEstDeviatio{n\left( {Tk} \right)}}$

-   -   -   6. Get updated CandidateList 315:            CandidateList={(T1,UUI(T1),(T2,UUI(T2)), . . . (Tn,UUI(Tn)))

With reference to Step 3 above and FIG. 4 , in one example, the adaptiveupdate facility determines whether there is a significant differencebetween estimated and actual query executions that would be indicativeof quantitative data being outdated. For instance, as illustrated inFIG. 4 , the optimizer component produces, in one embodiment, an accessplan which includes an anticipated number of returned rows R1, and ananticipated CPU usage time C1 for one or more SQL queries to the datastructure being considered. In a first actual execution of the SQLs, theaverage number of returned rows R2 is determined, along with the actualCPU time C2 for the queries. This process can be repeated for the latestexecution(s), obtaining an average actual number of returned rows R3,and an actual CPU time C3, for the executions, which can then be used inthe process discussed above to obtain the estimated deviations of thetop-most SQLs (in terms of CPU usage) and based thereon, to update theCandidateList 315 UUIs.

In the embodiment of FIG. 3 , the update urgency index (UUI) can furtherbe qualified by redetermining the index based on, for instance,predicted poor performance SQLs 314. In particular, the machine learningmodel(s) is trained, in one embodiment, to predictively identify SQLsthat are trending towards poor performance, and thus to indicate theneed for updated quantitative data for the data structures at issue. Inone embodiment, this can include:

-   -   Define Configurable Parameters:        -   Z=A difference between predicted and actual execution time>Z            % indicates potential bad performance;        -   CP4=Credit Points for Predicted Top SQLs    -   Steps: As indicated in FIG. 5 , the process can include in one        embodiment:        -   1. Collecting Top M SQLs, references any table in TableList,            and not in current top SQLs, and has a least 1 execution in            each 5 minutes period, get:            -   ReferencedTopSQLList 500        -   2. Predict which SQL(s) in ReferencedTopSQLList 500 likely            meet bad performance issue 501:        -   For each SQL SQLi in ReferencedTopSQLList, predict its            execution time—PredictExecutionTime(SQLi). (See discussion            below with reference to FIGS. 6A & 6B.)        -   If:

$\frac{\begin{matrix}{{{ActualExecutionTime}\left( {{SQ}Li} \right)} -} \\{{PredictedExecutionTime}\left( {SQLi} \right)}\end{matrix}}{{Pred}ictedExecutionTim{e\left( {SQLi} \right)}} > {Z\%}$

-   -   -   Add to PredictedBadSQLList(SQLi) 502 (FIG. 5 )        -   Get. PredictedBadSQLList        -   3. Recalculate UUI based on PredictedBadSQLList            -   3.1 For each SQLi in PredictedBadSQLList, Calculate                Estimated Deviation for SQLi:

${{PredictedDeviation}({SQLi})} = \frac{\begin{matrix}\left( {{{ActualExecutionTime}\left( {SQLi} \right)} -} \right. \\\left. {{PredictedExecutionTime}\left( {{SQ}Li} \right)} \right)^{2}\end{matrix}}{PredictedExecutionTim{e\left( {SQLi} \right)}^{2}}$

-   -   -   -   3.2 For each table T_(j) in TableList, determine its                Accumulative            -   Predicted Deviation:            -   If T_(j) is referenced in SQLi:                AccumPredictedDeviation(T                _(j))+=PredictedDeviation(SQLi)            -   3.3 For each data structure T_(k) in TableList,                recalculate its Update Urgency Index:

${{UUI}\left( {Tk}\text{)+} \right.} = {\frac{CP4}{\sum_{h = 1}^{n}\left( {AccumPredictedDeviatio{n\left( {Th} \right)}} \right)}*PredictedDeviatio{n\left( {Tk} \right)}}$

-   -   -   4. Get updated CandidateList 315:            CandidateList={(T1,UUI(T1),(T2,UUI(T2)), . . . (Tn,UUI(Tn)))

With reference to Step 2 above and FIGS. 6A & 6B, the execution time canbe based on fitting respective time-series data to a regressionalgorithm, such as the linear-fitting algorithms of FIG. 6A, or theFourier-fitting algorithm of FIG. 6B. By fitting the time-series data tothe applicable algorithm, the point of inflection where execution timedeviates from anticipated execution time can be predicted by the machinelearning model(s). A point of inflection can be due to differentreasons, with outdated quantitative data being one of the reasons, andthe focus of the machine-learning-based, adaptive updating ofquantitative data facility disclosed herein.

FIGS. 7A & 7B depict one embodiment of fitting tine-series data to theapplicable regression algorithm using linear-fitting or Fourier-fitting.

As illustrated in FIG. 7A, the execution time for one or more executionsequences can be ascertained and used to predict the execution time fora sequence at issue. As one example:

-   -   Variables can be defined which include:    -   Execution Seq: (unix_timestamp of current        execution−unix_timestamp of earliest execution in SQL cache        system since last update of quantitative data) divided by 300        (for instance).    -   Execution Time: Average execution time for all executions that        happened within “Execution Seq”.        T _(n) =f(Seq_(n)).

The steps can include processes as depicted in FIG. 7B, includingdetecting periodicity 700. Periodicity detection can be performed byauto-correlation coefficients analysis 701 and can include, forinstance, detecting periodicity every day 702, and whether there is afail for, for instance, three times 703, detecting periodicity everyweek 704, and whether there is a fail for, for instance, 3 times 705,and detecting periodicity every month 706, and whether there is a fail.Based on the periodicity detecting, processing determines whether theexecution time of the sequence is periodic 710, and if “yes”, aFourier-fitting algorithm 712 is used, while if “no”, a linear-fittingalgorithm 714 is used.

Returning to FIG. 3 , once the CandidateList 315 is completed with theassociated UUIs, the workflow includes merging (in one embodiment) theCandidateList with a CandidateList from a previous round or cycle ofadaptive update processing to obtain a MergedCandidateList 320. Usingthe MergedCandidateList, processing determines whether to update thequantitative data 330, and if “yes”, then the quantitative data facilityor runner 331 is executed to obtain performance metrics or to indicatethe performance metrics are to be obtained, for instance, at a more idletime of the database system. Any data structures having quantitativedata updated are removed from the list, and the remaining datastructures in the MergedCandidateList have their update urgency indexreduced 340, for instance, by half, in one example, so as not to biasthe next adaptive update cycle. The next adaptive update cycle 350 iscommenced, which as noted, includes starting with collecting TableList1and TableList2.

As noted, the machine-learning-based, adaptive updating of quantitativedata facility disclosed herein determines whether to update quantitativedata during any given update cycle, whether currently, or at a delayedtime. A decision tree is implemented (in one embodiment) by the machinelearning model(s) to direct this decision. In one example, the decisioncan utilize four attributes:

-   -   UUI Range—Divide (0, max(UUI)) into R (e.g., 24) ranges:        (RangeA1, RangeA2, . . . RangeA24}    -   Data Reads/s        -   1. ReadsAvg=Avg(All Data Reads/s)        -   2. For each Data Reads/s, ^(δ)DataReads=Data            Reads/s−ReadsAvg        -   3. Divide (Min(^(δ)DataReads), Max(^(δ)DataReads) into 24            ranges: (RangeB1, RangeB2, . . . RangeB24)    -   Same for Data Writes/s: {RangeC1, RangeC2, . . . RangeC24)    -   Completed Activities/s: Completed activities per second,        indicates the databases's degree of busyness:        -   (RangeD1, RangeD2, . . . RangeD24).    -   Observing Results—The system collects (in one embodiment)        performance metrics when and after updating of quantitative        data, and also collects metrics when it decides not to proceed        with an updating of quantitative data, such as an updating        request.    -   When system decides to collect quantitative data:        -   1. When statistics was updated, did the average execution            time of SQLs decrease?        -   2. Was there was a major transaction per second (TPS) drop            during quantitative data updating?    -   When system decides not to collect quantitative data:        -   3. Was there was a major transaction per second (TPS) drop            observed after the system delayed an update request?

FIG. 8 depicts exemplary results of a performance metrics collectorcollecting attributes periodically and the system collecting performancemetrics when and after updating of statistics, as well as metrics when aquantitative data collection update is delayed. In this manner, themachine learning model(s) continues to train when to update quantitativedata within the database system based on collected attributes.

Advantageously, the machine-learning-based, adaptive updating ofquantitative data in a database system disclosed herein implements aprocess of updating quantitative data, or statistics, adaptively andintelligently in the database based, for instance, on data changes anddata reads, as well as query performance and system performance. Theupdate of quantitative data occurs when necessary because thequantitative data update requirement is evaluated accurately withautomatic optimization ability. Further, the updating of quantitativedata can run automatically at the correct time, such as when queryperformance is already poor, or such as when query performance is likelyto soon be poor, and/or at a time when collecting the quantitative datawill have little influence on other executing database applications.

Other variations and embodiments are possible.

Another embodiment of a computing environment to incorporate and use oneor more aspects of the present invention is described with reference toFIG. 9A. In this example, a computing environment 36 includes, forinstance, a native central processing unit (CPU) 37, a memory 38, andone or more input/output devices and/or interfaces 39 coupled to oneanother via, for example, one or more buses 40 and/or other connections.As examples, computing environment 36 may include a Power® processoroffered by International Business Machines Corporation, Armonk, NewYork; an HP Superdome with Intel® processors offered by Hewlett PackardCo., Palo Alto, California; and/or other machines based on architecturesoffered by International Business Machines Corporation, Hewlett Packard,Intel Corporation, Oracle, and/or others. PowerPC is a trademark orregistered trademark of International Business Machines Corporation inat least one jurisdiction. Intel is a trademark or registered trademarkof Intel Corporation or its subsidiaries in the United States and othercountries.

Native central processing unit 37 includes one or more native registers41, such as one or more general purpose registers and/or one or morespecial purpose registers used during processing within the environment.These registers include information that represents the state of theenvironment at any particular point in time.

Moreover, native central processing unit 37 executes instructions andcode that are stored in memory 38. In one particular example, thecentral processing unit executes emulator code 42 stored in memory 38.This code enables the computing environment configured in onearchitecture to emulate another architecture. For instance, emulatorcode 42 allows machines based on architectures other than thez/Architecture instruction set architecture, such as Power processors,HP Superdome servers or others, to emulate the z/Architectureinstruction set architecture and to execute software and instructionsdeveloped based on the z/Architecture instruction set architecture.

Further details relating to emulator code 42 are described withreference to FIG. 9B. Guest instructions 43 stored in memory 38 comprisesoftware instructions (e.g., correlating to machine instructions) thatwere developed to be executed in an architecture other than that ofnative CPU 37. For example, guest instructions 43 may have been designedto execute on a processor based on the z/Architecture instruction setarchitecture, but instead, are being emulated on native CPU 37, whichmay be, for example, an Intel processor. In one example, emulator code42 includes an instruction fetching routine 44 to obtain one or moreguest instructions 43 from memory 38, and to optionally provide localbuffering for the instructions obtained. It also includes an instructiontranslation routine 45 to determine the type of guest instruction thathas been obtained and to translate the guest instruction into one ormore corresponding native instructions 46. This translation includes,for instance, identifying the function to be performed by the guestinstruction and choosing the native instruction(s) to perform thatfunction.

Further, emulator code 42 includes an emulation control routine 47 tocause the native instructions to be executed. Emulation control routine47 may cause native CPU 37 to execute a routine of native instructionsthat emulate one or more previously obtained guest instructions and, atthe conclusion of such execution, return control to the instructionfetch routine to emulate the obtaining of the next guest instruction ora group of guest instructions. Execution of the native instructions 46may include loading data into a register from memory 38; storing databack to memory from a register; or performing some type of arithmetic orlogic operation, as determined by the translation routine.

Each routine is, for instance, implemented in software, which is storedin memory and executed by native central processing unit 37. In otherexamples, one or more of the routines or operations are implemented infirmware, hardware, software or some combination thereof. The registersof the emulated processor may be emulated using registers 41 of thenative CPU or by using locations in memory 38. In embodiments, guestinstructions 43, native instructions 46 and emulator code 42 may residein the same memory or may be disbursed among different memory devices.

The computing environments described above are only examples ofcomputing environments that can be used. Other environments, includingbut not limited to, non-partitioned environments, partitionedenvironments, cloud environments and/or emulated environments, may beused; embodiments are not limited to any one environment. Althoughvarious examples of computing environments are described herein, one ormore aspects of the present invention may be used with many types ofenvironments. The computing environments provided herein are onlyexamples.

Each computing environment is capable of being configured to include oneor more aspects of the present invention.

One or more aspects may relate to cloud computing.

It is to be understood that although this disclosure includes a detaileddescription on cloud computing, implementation of the teachings recitedherein are not limited to a cloud computing environment. Rather,embodiments of the present invention are capable of being implemented inconjunction with any other type of computing environment now known orlater developed.

Cloud computing is a model of service delivery for enabling convenient,on-demand network access to a shared pool of configurable computingresources (e.g., networks, network bandwidth, servers, processing,memory, storage, applications, virtual machines, and services) that canbe rapidly provisioned and released with minimal management effort orinteraction with a provider of the service. This cloud model may includeat least five characteristics, at least three service models, and atleast four deployment models.

Characteristics are as follows:

On-demand self-service: a cloud consumer can unilaterally provisioncomputing capabilities, such as server time and network storage, asneeded automatically without requiring human interaction with theservice's provider.

Broad network access: capabilities are available over a network andaccessed through standard mechanisms that promote use by heterogeneousthin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to servemultiple consumers using a multi-tenant model, with different physicaland virtual resources dynamically assigned and reassigned according todemand. There is a sense of location independence in that the consumergenerally has no control or knowledge over the exact location of theprovided resources but may be able to specify location at a higher levelof abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elasticallyprovisioned, in some cases automatically, to quickly scale out andrapidly released to quickly scale in. To the consumer, the capabilitiesavailable for provisioning often appear to be unlimited and can bepurchased in any quantity at any time.

Measured service: cloud systems automatically control and optimizeresource use by leveraging a metering capability at some level ofabstraction appropriate to the type of service (e.g., storage,processing, bandwidth, and active user accounts). Resource usage can bemonitored, controlled, and reported, providing transparency for both theprovider and consumer of the utilized service.

Service Models are as follows:

Software as a Service (SaaS): the capability provided to the consumer isto use the provider's applications running on a cloud infrastructure.The applications are accessible from various client devices through athin client interface such as a web browser (e.g., web-based e-mail).The consumer does not manage or control the underlying cloudinfrastructure including network, servers, operating systems, storage,or even individual application capabilities, with the possible exceptionof limited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer isto deploy onto the cloud infrastructure consumer-created or acquiredapplications created using programming languages and tools supported bythe provider. The consumer does not manage or control the underlyingcloud infrastructure including networks, servers, operating systems, orstorage, but has control over the deployed applications and possiblyapplication hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to theconsumer is to provision processing, storage, networks, and otherfundamental computing resources where the consumer is able to deploy andrun arbitrary software, which can include operating systems andapplications. The consumer does not manage or control the underlyingcloud infrastructure but has control over operating systems, storage,deployed applications, and possibly limited control of select networkingcomponents (e.g., host firewalls).

Deployment Models are as follows:

Private cloud: the cloud infrastructure is operated solely for anorganization. It may be managed by the organization or a third party andmay exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by severalorganizations and supports a specific community that has shared concerns(e.g., mission, security requirements, policy, and complianceconsiderations). It may be managed by the organizations or a third partyand may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the generalpublic or a large industry group and is owned by an organization sellingcloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or moreclouds (private, community, or public) that remain unique entities butare bound together by standardized or proprietary technology thatenables data and application portability (e.g., cloud bursting forload-balancing between clouds).

A cloud computing environment is service oriented with a focus onstatelessness, low coupling, modularity, and semantic interoperability.At the heart of cloud computing is an infrastructure that includes anetwork of interconnected nodes.

Referring now to FIG. 10 , illustrative cloud computing environment 50is depicted. As shown, cloud computing environment 50 includes one ormore cloud computing nodes 52 with which local computing devices used bycloud consumers, such as, for example, personal digital assistant (PDA)or cellular telephone 54A, desktop computer 54B, laptop computer 54C,and/or automobile computer system 54N may communicate. Nodes 52 maycommunicate with one another. They may be grouped (not shown) physicallyor virtually, in one or more networks, such as Private, Community,Public, or Hybrid clouds as described hereinabove, or a combinationthereof. This allows cloud computing environment 50 to offerinfrastructure, platforms and/or software as services for which a cloudconsumer does not need to maintain resources on a local computingdevice. It is understood that the types of computing devices 54A-N shownin FIG. 10 are intended to be illustrative only and that computing nodes52 and cloud computing environment 50 can communicate with any type ofcomputerized device over any type of network and/or network addressableconnection (e.g., using a web browser).

Referring now to FIG. 11 , a set of functional abstraction layersprovided by cloud computing environment 50 (FIG. 10 ) is shown. Itshould be understood in advance that the components, layers, andfunctions shown in FIG. 11 are intended to be illustrative only andembodiments of the invention are not limited thereto. As depicted, thefollowing layers and corresponding functions are provided:

Hardware and software layer 60 includes hardware and softwarecomponents. Examples of hardware components include: mainframes 61; RISC(Reduced Instruction Set Computer) architecture based servers 62;servers 63; blade servers 64; storage devices 65; and networks andnetworking components 66. In some embodiments, software componentsinclude network application server software 67 and database software 68.

Virtualization layer 70 provides an abstraction layer from which thefollowing examples of virtual entities may be provided: virtual servers71; virtual storage 72; virtual networks 73, including virtual privatenetworks; virtual applications and operating systems 74; and virtualclients 75.

In one example, management layer 80 may provide the functions describedbelow. Resource provisioning 81 provides dynamic procurement ofcomputing resources and other resources that are utilized to performtasks within the cloud computing environment. Metering and Pricing 82provide cost tracking as resources are utilized within the cloudcomputing environment, and billing or invoicing for consumption of theseresources. In one example, these resources may include applicationsoftware licenses. Security provides identity verification for cloudconsumers and tasks, as well as protection for data and other resources.User portal 83 provides access to the cloud computing environment forconsumers and system administrators. Service level management 84provides cloud computing resource allocation and management such thatrequired service levels are met. Service Level Agreement (SLA) planningand fulfillment 85 provide pre-arrangement for, and procurement of,cloud computing resources for which a future requirement is anticipatedin accordance with an SLA.

Workloads layer 90 provides examples of functionality for which thecloud computing environment may be utilized. Examples of workloads andfunctions which may be provided from this layer include: mapping andnavigation 91; software development and lifecycle management 92; virtualclassroom education delivery 93; data analytics processing 94;transaction processing 95; and adaptive updating of quantitative dataprocessing 96.

Aspects of the present invention may be a system, a method, and/or acomputer program product at any possible technical detail level ofintegration. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, configuration data for integrated circuitry, oreither source code or object code written in any combination of one ormore programming languages, including an object oriented programminglanguage such as Smalltalk, C++, or the like, and procedural programminglanguages, such as the “C” programming language or similar programminglanguages. The computer readable program instructions may executeentirely on the user's computer, partly on the user's computer, as astand-alone software package, partly on the user's computer and partlyon a remote computer or entirely on the remote computer or server. Inthe latter scenario, the remote computer may be connected to the user'scomputer through any type of network, including a local area network(LAN) or a wide area network (WAN), or the connection may be made to anexternal computer (for example, through the Internet using an InternetService Provider). In some embodiments, electronic circuitry including,for example, programmable logic circuitry, field-programmable gatearrays (FPGA), or programmable logic arrays (PLA) may execute thecomputer readable program instructions by utilizing state information ofthe computer readable program instructions to personalize the electroniccircuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a computer, or other programmable data processing apparatusto produce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks. These computerreadable program instructions may also be stored in a computer readablestorage medium that can direct a computer, a programmable dataprocessing apparatus, and/or other devices to function in a particularmanner, such that the computer readable storage medium havinginstructions stored therein comprises an article of manufactureincluding instructions which implement aspects of the function/actspecified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the blocks may occur out of theorder noted in the Figures. For example, two blocks shown in successionmay, in fact, be accomplished as one step, executed concurrently,substantially concurrently, in a partially or wholly temporallyoverlapping manner, or the blocks may sometimes be executed in thereverse order, depending upon the functionality involved. It will alsobe noted that each block of the block diagrams and/or flowchartillustration, and combinations of blocks in the block diagrams and/orflowchart illustration, can be implemented by special purposehardware-based systems that perform the specified functions or acts orcarry out combinations of special purpose hardware and computerinstructions.

In addition to the above, one or more aspects may be provided, offered,deployed, managed, serviced, etc. by a service provider who offersmanagement of customer environments. For instance, the service providercan create, maintain, support, etc. computer code and/or a computerinfrastructure that performs one or more aspects for one or morecustomers. In return, the service provider may receive payment from thecustomer under a subscription and/or fee agreement, as examples.Additionally or alternatively, the service provider may receive paymentfrom the sale of advertising content to one or more third parties.

In one aspect, an application may be deployed for performing one or moreembodiments. As one example, the deploying of an application comprisesproviding computer infrastructure operable to perform one or moreembodiments.

As a further aspect, a computing infrastructure may be deployedcomprising integrating computer readable code into a computing system,in which the code in combination with the computing system is capable ofperforming one or more embodiments.

As yet a further aspect, a process for integrating computinginfrastructure comprising integrating computer readable code into acomputer system may be provided. The computer system comprises acomputer readable medium, in which the computer medium comprises one ormore embodiments. The code in combination with the computer system iscapable of performing one or more embodiments.

Although various embodiments are described above, these are onlyexamples. For instance, computing environments of other architecturescan be used to incorporate and/or use one or more aspects. Further,different instructions or operations may be used. Additionally,different types of registers and/or different registers may be used.Further, other data formats, data layouts and/or data sizes may besupported. In one or more embodiments, one or more general-purposeprocessors, one or more special-purpose processors or a combination ofgeneral-purpose and special-purpose processors may be used. Manyvariations are possible.

Various aspects are described herein. Further, many variations arepossible without departing from a spirit of aspects of the presentinvention. It should be noted that, unless otherwise inconsistent, eachaspect or feature described herein, and variants thereof, may becombinable with any other aspect or feature.

Further, other types of computing environments can benefit and be used.As an example, a data processing system suitable for storing and/orexecuting program code is usable that includes at least two processorscoupled directly or indirectly to memory elements through a system bus.The memory elements include, for instance, local memory employed duringactual execution of the program code, bulk storage, and cache memorywhich provide temporary storage of at least some program code in orderto reduce the number of times code must be retrieved from bulk storageduring execution.

Input/Output or I/O devices (including, but not limited to, keyboards,displays, pointing devices, DASD, tape, CDs, DVDs, thumb drives andother memory media, etc.) can be coupled to the system either directlyor through intervening I/O controllers. Network adapters may also becoupled to the system to enable the data processing system to becomecoupled to other data processing systems or remote printers or storagedevices through intervening private or public networks. Modems, cablemodems, and Ethernet cards are just a few of the available types ofnetwork adapters.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting. As used herein, thesingular forms “a”, “an” and “the” are intended to include the pluralforms as well, unless the context clearly indicates otherwise. It willbe further understood that the terms “comprises” and/or “comprising”,when used in this specification, specify the presence of statedfeatures, integers, steps, operations, elements, and/or components, butdo not preclude the presence or addition of one or more other features,integers, steps, operations, elements, components and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below, if any, areintended to include any structure, material, or act for performing thefunction in combination with other claimed elements as specificallyclaimed. The description of one or more embodiments has been presentedfor purposes of illustration and description, but is not intended to beexhaustive or limited to in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the art. Theembodiment was chosen and described in order to best explain variousaspects and the practical application, and to enable others of ordinaryskill in the art to understand various embodiments with variousmodifications as are suited to the particular use contemplated.

What is claimed is:
 1. A computer program product for facilitatingprocessing within a computing environment, the computer program productcomprising: one or more computer-readable storage media having programinstructions embodied therewith, the program instructions being readableby a processing circuit to cause the processing circuit to perform amethod comprising: training one or more machine learning models tofacilitate adaptively updating quantitative data in a database system;ascertaining an update urgency index for updating quantitative data forone or more data structures of the database system, the update urgencyindex being representative of an urgency for updating the quantitativedata for the data structure(s) and being based, at least in part, onreal-time query metrics; predicting, via the machine learning model(s),an execution time of one or more database queries to the datastructure(s), wherein the real-time query metrics are based on adifference between the predicted execution time of the one or moredatabase queries to the data structure(s) in comparison to an actualexecution time of the one or more database queries to the datastructure(s), and wherein the difference between the predicted executiontime of the one or more database queries to the data structure(s) andthe actual execution time of the one or more database queries to thedata structure(s) exceeding a threshold predicts poor query performance,and increases the update urgency index to indicate an urgency forupdating the quantitative data of the data structure(s) in the databasesystem; adaptively updating, using the machine learning model(s), thequantitative data, the adaptively updating being based, at least inpart, on the ascertained update urgency index; and optimizing processingof a database query in the database system using the adaptively updatedquantitative data.
 2. The computer program product of claim 1, whereinthe real-time query metrics comprise a volume and frequency of databasequeries to the data structure(s) in the database system.
 3. The computerprogram product of claim 1, wherein the real-time query metrics arebased, at least in part, on collecting M top-most database queries tothe data structure(s) in order of processor usage for a time intervaland estimating therefor a deviation in usage from an estimated processorusage for the M top-most database queries, the estimated deviation beingrepresentative of a performance deviation of the M top-most databasequeries, where M≥1.
 4. The computer program product of claim 1, whereinthe predicting, by the machine learning model(s), the execution time forthe one or more database queries uses regression analysis based on timeseries data.
 5. The computer program product of claim 1, wherein theadaptively updating comprises adaptively updating the quantitative databased on a relative urgency of the ascertained update urgency index, theadaptively updating including currently proceeding with updating of thequantitative data where the ascertained update urgency index indicatesupdating of the quantitative data is urgent, and delaying proceedingwith updating of the quantitative data where the ascertained updateurgency index indicates that the updating is not urgent.
 6. The computerprogram product of claim 1, further comprising identifying a list ofdata structures for which the update urgency index is to be ascertained,the one or more data structures being in the list of data structures,the list of data structures including any data structures with majordata changes since a last updating of quantitative data, any datastructures with no quantitative data, and any data structures with stalequantitative data.
 7. The computer program product of claim 6, furthercomprising predictively identifying, by the machine learning model(s), adata structure in the database system with degrading query executionperformance, wherein the list of data structures further includes thepredictively identified data structure with degrading query executionperformance.
 8. A computer system for facilitating processing within acomputing environment, the computer system comprising: a memory; and aprocessing circuit in communication with the memory, wherein thecomputer system is configured to perform a method, the methodcomprising: training one or more machine learning models to facilitateadaptively updating quantitative data in a database system; ascertainingan update urgency index for updating quantitative data for one or moredata structures of the database system, the update urgency index beingrepresentative of an urgency for updating the quantitative data for thedata structure(s) and being based, at least in part, on real-time querymetrics; predicting, via the machine learning model(s), an executiontime of one or more database queries to the data structure(s), whereinthe real-time query metrics are based on a difference between thepredicted execution time of the one or more database queries to the datastructure(s) in comparison to an actual execution time of the one ormore database queries to the data structure(s), and wherein thedifference between the predicted execution time of the one or moredatabase queries to the data structure(s) and the actual execution timeof the one or more database queries to the data structure(s) exceeding athreshold predicts poor query performance, and increases the updateurgency index to indicate an urgency for updating the quantitative dataof the data structure(s) in the database system; adaptively updating,using the machine learning model(s), the quantitative data, theadaptively updating being based, at least in part, on the ascertainedupdate urgency index; and optimizing processing of a database query inthe database system using, at least in part, the adaptively updatedquantitative data.
 9. The computer system of claim 8, wherein thereal-time query metrics comprise a volume and frequency of databasequeries to the data structure(s) in the database system.
 10. Thecomputer system of claim 8, wherein the real-time query metrics arebased, at least in part, on collecting M top-most database queries tothe data structure(s) in order of processor usage for a time intervaland estimating therefor a deviation in usage from an estimated processorusage for the M top-most database queries, the estimated deviation beingrepresentative of a performance deviation of the M top-most databasequeries, where M≥1.
 11. The computer system of claim 8, wherein thepredicting, by the machine learning model(s), the execution time for theone or more database queries uses regression analysis based on timeseries data.
 12. The computer system of claim 8, further comprisingidentifying a list of data structures for which the update urgency indexis to be ascertained, the one or more data structures being in the listof data structures, the list of data structures including any datastructures with major data changes since a last updating of quantitativedata, any data structures with no quantitative data, and any datastructures with stale quantitative data.
 13. A computer-implementedmethod of facilitating processing within a computing environment, thecomputer-implemented method comprising: training one or more machinelearning models to facilitate adaptively updating quantitative data in adatabase system; ascertaining an update urgency index for updatingquantitative data for one or more data structures of the databasesystem, the update urgency index being representative of an urgency forupdating the quantitative data for the data structure(s) and beingbased, at least in part, on real-time query metrics; predicting, via themachine learning model(s), an execution time of one or more databasequeries to the data structure(s), wherein the real-time query metricsare based on a difference between the predicted execution time of theone or more database queries to the data structure(s) in comparison toan actual execution time of the one or more database queries to the datastructure(s), and wherein the difference between the predicted executiontime of the one or more database queries to the data structure(s) andthe actual execution time of the one or more database queries to thedata structure(s) exceeding a threshold predicts poor query performance,and increases the update urgency index to indicate an urgency forupdating the quantitative data of the data structure(s) in the databasesystem; adaptively updating, using the machine learning model(s), thequantitative data, the adaptively updating being based, at least inpart, on the ascertained update urgency index; and optimizing processingof a database query in the database system using, at least in part, theadaptively updated quantitative data.
 14. The computer-implementedmethod of claim 13, wherein the real-time query metrics comprise avolume and frequency of database queries to the data structure(s) in thedatabase system.
 15. The computer-implemented method of claim 13,wherein the real-time query metrics are based, at least in part, oncollecting M top-most database queries to the data structure(s) in orderof processor usage for a time interval and estimating therefor adeviation in usage from an estimated processor usage for the M top-mostdatabase queries, the estimated deviation being representative of aperformance deviation of the M top-most database queries, where M≥1.